A Kriging-based global optimization method using multi-points infill search criterion
نویسندگان
چکیده
منابع مشابه
A benchmark of kriging-based infill criteria for noisy optimization
Responses of many real-world problems can only be evaluated perturbed by noise. In order to make an efficient optimization of these problems possible, intelligent optimization strategies successfully coping with noisy evaluations are required. In this article, a comprehensive comparison of existing kriging-based methods for the optimization of noisy functions is provided. Ten methods are descri...
متن کاملCONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD
Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...
متن کاملA Kriging-based Unconstrained Global Optimization Algorithm
Efficient Global Optimization (EGO) algorithm with Kriging model is stable and effective for an expensive black-box function. However, How to get a more global optimal point on the basis of surrogates has been concerned in simulation-based design optimization. In order to better solve a black-box unconstrained optimization problem, this paper introduces a new EGO method named improved generaliz...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A New Method for Global Optimization Using Hyperbolic Cross Points
We propose a new numerical method for finding the global minimum of a function f : [0, 1] → R. Our method is based only on function values at the hyperbolic cross points and uses an adaptive order of these points. We motivate our method by complexity results and also give numerical examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2017
ISSN: 1748-3018,1748-3026
DOI: 10.1177/1748301817725307